Numerical Quadrature of Fourier Transform

ثبت نشده
چکیده

In some cases the function <£(£) or \pik) is given by a closed expression which is too complicated to permit a sufficiently accurate analytic evaluation of the integral for the entire range of the parameter x. In other cases 4>ik) or ^(&) may be available only in numerical form. The conventional methods of numerical quadrature (e.g., Simpson's rule) are not suitable for evaluation of the above integrals when x is large. There are two reasons for the failure of the standard methods in this case. First, because of the rapid oscillation of the trigonometric function when x is large the integrand cannot be accurately approximated by simple polynomials unless undesirably small intervals of integration are chosen. Secondly, the extremely strong cancellation between the contributions to the integral from regions where the trigonometric function is positive and regions where it is negative tends to accentuate the errors in the conventional integration procedures. Filon [1] and Luke [2] have suggested methods of integration which avoid the first difficulty by using polynomial approximations for ik) or \pik) rather than for the entire integrand. In this note we shall discuss a new scheme which attempts to alleviate the second difficulty as well. In this scheme all half cycles of the trigonometric functions are treated in an identical manner so that no cancellation errors arise. The integration scheme for the individual half cycles is based on a Gaussian type integration procedure [3] which minimizes the error in the final result for a given number of integration points per half cycle. In developing the integration formulas for the individual half cycles, it is imagined that the integrals in (la) and (lb) are evaluated by first performing the sum of the integrand at corresponding points in all half cycles and then integrating the result over a single half cycle. The sum over corresponding points in all the half cycles possesses certain properties which, particularly for large x, enable the final integral to be accurately evaluated with a small number of points per half cycle. In the actual numerical evaluation of the integral, the integrations are first performed over the individual half cycles, and then the total contributions of the various half cycles are summed. Although the integration formulas are not accurate for the individual half cycles, most of the error cancels when the sum over half cycles is performed (see section V). In performing the sum over half cycles, the standard techniques for accelerating the convergence of the sums of an oscillating series can be employed. This

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Numerical solution of general nonlinear Fredholm-Volterra integral equations using Chebyshev ‎approximation

A numerical method for solving nonlinear Fredholm-Volterra integral equations of general type is presented. This method is based on replacement of unknown function by truncated series of well known Chebyshev expansion of functions. The quadrature formulas which we use to calculate integral terms have been imated by Fast Fourier Transform (FFT). This is a grate advantage of this method which has...

متن کامل

Sine Function Quadrature Rules for the Fourier Integral

In this paper a numerical algorithm is proposed for the computation of the Fourier Transform. The quadrature rule developed is based on the Whittaker Cardinal Function expansion of the integrand and a certain Conformai Map. The error of the method is analyzed and numerical results are reported which confirm the accuracy of the quadrature rule.

متن کامل

Improved FFT Approximations of Probability Functions Based on Modified Quadrature Rules

In the last ten years, the traditional Simpson quadrature rule for numerical integration has been improved to an optimal 3-point quadrature formula and a modified Simpson rule that takes additionally the first derivative of the approximated integrand at the two end-points of integration into account. The impact of the improved quadrature rules on the fast Fourier transform (FFT) approximation o...

متن کامل

On the computation of nonnegative quadrature weights on the sphere

We compute quadrature weights for scattered nodes on the two-dimensional unit-sphere, which are exact for spherical polynomials of high degree N . Different algorithms are proposed and numerical examples show that we can compute nonnegative quadrature weights if approximately 4N2/3 well distributed nodes are used. We compare these results with theoretical statements which guarantee nonnegative ...

متن کامل

A pseudospectral quadrature method for Navier-Stokes equations on rotating spheres

In this work, we describe, analyze, and implement a pseudospectral quadrature method for a global computer modeling of the incompressible surface Navier-Stokes equations on the rotating unit sphere. Our spectrally accurate numerical error analysis is based on the Gevrey regularity of the solutions of the Navier-Stokes equations on the sphere. The scheme is designed for convenient application of...

متن کامل

A Fourier-Based Valuation Method for Bermudan and Barrier Options under Heston's Model

We develop an efficient Fourier-based numerical method for pricing Bermudan and discretely monitored barrier options under the Heston stochastic volatility model. The two-dimensional pricing problem is dealt with by a combination of a Fourier cosine series expansion, as in [9, 10], and high-order quadrature rules in the other dimension. Error analysis and experiments confirm a fast error conver...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010